<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    16. 3Sum Closest
   </h1>
   <p>
    Given an array
    <code>
     nums
    </code>
    of
    <em>
     n
    </em>
    integers and an integer
    <code>
     target
    </code>
    , find three integers in
    <code>
     nums
    </code>
    &nbsp;such that the sum is closest to&nbsp;
    <code>
     target
    </code>
    . Return the sum of the three integers. You may assume that each input would have exactly one solution.
   </p>
   <p>
    <strong>
     Example:
    </strong>
   </p>
   <pre>
Given array nums = [-1, 2, 1, -4], and target = 1.

The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
</pre>
  </div>
  <div>
   <h1 class="question_title">
    16. 最接近的三数之和
   </h1>
   <p>
    给定一个包括&nbsp;
    <em>
     n
    </em>
    个整数的数组&nbsp;
    <code>
     nums
    </code>
    <em>
     &nbsp;
    </em>
    和 一个目标值&nbsp;
    <code>
     target
    </code>
    。找出&nbsp;
    <code>
     nums
    </code>
    <em>
     &nbsp;
    </em>
    中的三个整数，使得它们的和与&nbsp;
    <code>
     target
    </code>
    &nbsp;最接近。返回这三个数的和。假定每组输入只存在唯一答案。
   </p>
   <pre>例如，给定数组 nums = [-1，2，1，-4], 和 target = 1.

与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).
</pre>
  </div>
 </body>
</html>